Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
نویسندگان
چکیده
For given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F for which the strong Ramsey arrow F −→ (G)r holds. We concentrate on the situation when H is not a complete graph. The set of graphs G for which there exists an F satisfying F −→ (G)2 2 (P2 is a path on 3 vertices) is found to be the union of the set of chordal comparability graphs together with the set of convex graphs.
منابع مشابه
On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs
For a fixed graph H on k vertices, we investigate the graphs, G, such that for any partition of the vertices of G into k color classes, there is a transversal of that partition inducing H. For every integer k ≥ 1, we find a family F of at most six graphs on k vertices such that the following holds. If H / ∈ F , then for any graph G on at least 4k − 1 vertices, there is a k-coloring of vertices ...
متن کاملSome Developments in Ramsey Theory
Ramsey Theory is a part of combinatorial mathematics that studies the behaviour of structures under partitions. Many Ramsey type results assert that complete disorder is impossible they find some regular substructures in general combinatorial structures. Generic results are due to F.P. Ramsey [R3] and B.L. van der Waerden [V]. The systematic study of these and related statements was initiated b...
متن کاملRamsey graphs contain many distinct induced subgraphs
It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least 2./( 2r2o ~2t)) distinct induced subgraphs.
متن کاملOn Unavoidable Induced Subgraphs in Large Prime Graphs
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key model-theoretic ingredient of first determining the so-called amount of stability of the graph. This approach changes the applicable Ramsey theorem, improves the bound...
متن کاملMonochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey
Nowadays the term monochromatic and heterochromatic (or rainbow, multicolored) subgraphs of an edge colored graph appeared frequently in literature, and many results on this topic have been obtained. In this paper, we survey results on this subject. We classify the results into the following categories: vertex-partitions by monochromatic subgraphs, such as cycles, paths, trees; vertex partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 59 شماره
صفحات -
تاریخ انتشار 1993